10th Anniversary Treasure Hunt
نویسندگان
چکیده
Cross-domain Beginner 0.5 hour In 2017 the EMBL-EBI Training Programme is celebrating 10 amazing years of providing onsite, offsite and online training in bioinformatics. To help celebrate this anniversary, we designed a treasure hunt to give you a taster of the free resources and (sometimes quirky) data that EMBL-EBI has on offer. This year also happened to be the UN year for “Sustainable tourism for development” and so we adopted travel as our theme. There are 10 clues to help you navigate through the various EMBL-EBI resources (locations) to collect tourism related data.
منابع مشابه
Traditional Fermented Indian Foods: A Treasure Hunt for Rare Lactic Acid Bacteria
This article has no abstract. DOI: 10.18502/jfqhc.6.2.952
متن کاملInfluencing the Learning Experience Through Affective Agent Feedback in a Real-World Treasure Hunt: (Extended Abstract)
We explore the effect of the behaviour of a virtual robot agent in the context of a real-world treasure-hunt activity carried out by children aged 11–12. We compare three conditions: a traditional paper-based treasure hunt, along with a virtual robot on a tablet which provides either neutral or affective feedback during the treasure hunt. The results of the study suggest that the use of the vir...
متن کاملA Treasure Hunt With An Empathic Virtual Tutor: (Demonstration)
We present a demonstration of a Treasure Hunt Application with an Empathic Virtual Tutor. During the treasure hunt, this empathic agent adapts its interaction based on the affective state of the user to improve learning experience. We demonstrate the application domain; the technology used; and the app focusing on the empathic strategies applied.
متن کاملInformation-driven Sensor Path Planning and the Treasure Hunt Problem
Engineering—Mechanical) INFORMATION-DRIVEN SENSOR PATH PLANNING AND THE TREASURE HUNT PROBLEM by Chenghui Cai Department of Mechanical Engineering and Materials Science Duke University
متن کاملFaster Treasure Hunt and Better Strongly Universal Exploration Sequences
In this paper, we investigate the explicit deterministic treasure hunt problem in a n-vertex network. This problem was firstly introduced by Ta-Shma and Zwick in [10] [SODA’07]. Note also it is a variant of the well known rendezvous problem in which one of the robot (the treasure) is always stationary. In this paper, we propose an O(n 1 λ )-time algorithm for the treasure hunt problem, which si...
متن کامل